Cycle and Path Embedding on 5-ary N-cubes
نویسندگان
چکیده
We study two topological properties of the 5-ary n-cube Qn. Given two arbitrary distinct nodes x and y in Q 5 n, we prove that there exists an x-y path of every length ranging from 2n to 5n−1, where n ≥ 2. Based on this result, we prove that Qn is 5-edge-pancyclic by showing that every edge in Qn lies on a cycle of every length ranging from 5 to 5. Mathematics Subject Classification. 68R10, 68R05, 05C12.
منابع مشابه
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
The k-ary n-cubes, Qn, is one of the most well-known interconnection networks in parallel computers. Let n ≥ 1 be an integer and k ≥ 3 be an odd integer. It has been shown that any Qn is a 2n-regular, vertex symmetric and edge symmetric graph with a hamiltonian cycle. In this article, we prove that any k-ary n-cube contains 2n mutually independent hamiltonian cycles. More specifically, let vi ∈...
متن کاملHamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k 3 be an odd integer. When |F | 2n−2, we show that there exists a hamiltonian cycle in a wound...
متن کاملEmbedding long cycles in faulty k-ary 2-cubes
The class of k-ary n-cubes represents the most commonly used interconnection topology for distributed-memory parallel systems. Given an even k P 4, let (V1,V2) be the bipartition of the k-ary 2-cube, fv1, fv2 be the numbers of faulty vertices in V1 and V2, respectively, and fe be the number of faulty edges. In this paper, we prove that there exists a cycle of length k 2max{fv1, fv2} in the k-ar...
متن کاملThe fault-tolerant bipancyclicity of the even k-ary n-cube
The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks, including the ring, the torus and the hypercube, that are attractive in both theoretical interests and practical systems can be regarded as the subclasses of the k-ary n-cubes. In this paper, we investigate the fault tolerant cycle e...
متن کاملThe Panpositionable Hamiltonicity of k-ary n-cubes
The hypercube Qn is one of the most well-known and popular interconnection networks and the k-ary n-cubeQn is an enlarged family from Qn that keeps many pleasing properties from hypercubes. In this article, we study the panpositionable hamiltonicity of Qn for k ≥ 3 and n ≥ 2. Let x, y of V (Qn) be two arbitrary vertices and C be a hamiltonian cycle of Qn. We use dC(x, y) to denote the distance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 43 شماره
صفحات -
تاریخ انتشار 2009